On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
نویسندگان
چکیده
منابع مشابه
On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
A deterministic server is shared by users with identical linear waiting costs, requesting jobs of arbitrary lengths. Shortest jobs are served ...rst for e¢ciency. When the server can monitor the length of a job, but not the identity of its user, merging, splitting or partially transferring jobs may o¤er strategic opportunities to cooperative agents. Can we design cash transfers to neutralize su...
متن کاملAppendix To Reducing Tardiness Under Global Scheduling by Splitting Jobs
T split i = T base i si , (A.9) and we add a prime to any variable to indicate the version that accounts for overheads. Aside from the modifications described below, we model split tasks as full tasks with worst-case execution time C i and period T split i , so that subjobs function as jobs. As discussed in Sec. 5, several overheads cannot be incurred by all subjobs. The event latency ∆ appears...
متن کاملScheduling Jobs on Several Machines with the Job Splitting Property
This scheduling model is derived from the real problem of scheduling looms in a textile industry. Jobs may be independently split over several specified machines and preemption is allowed. Deadlines are specified for each job and jobs are assumed to be available. It is shown that minimizing maximum weighted tardiness can be done in polynomial time. The case of uniform machines (as in the consid...
متن کاملMerging and Splitting Eigenspace Models
We present new deterministic methods that given two eigenspace models, each representing a set of n-dimensional observations will: (1) merge the models to yield a representation of the union of the sets; (2) split one model from another to represent the difference between the sets; as this is done, we accurately keep track of the mean. These methods are more efficient than computing new eigensp...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2007
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.1060.0239